Comparison of Two-Level Preconditioners Derived from Deflation, Domain Decomposition and Multigrid Methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Two-Level Preconditioners Derived from Deflation, Domain Decomposition and Multigrid Methods

For various applications, it is well-known that a multi-level, in particular twolevel, preconditioned CG (PCG) method is an efficient method for solving large and sparse linear systems with a coefficient matrix that is symmetric positive definite. The corresponding two-level preconditioner combines traditional and projection-type preconditioners to get rid of the effect of both small and large ...

متن کامل

Theoretical and Numerical Comparison of Projected Cg Methods Derived from Deflation, Domain Decomposition and Multigrid Methods

For various applications, it is well-known that a multi-level, in particular two-level, preconditioned Krylov method is an efficient method for solving large and sparse linear systems. A combination of traditional and projection-type preconditioners is used to get rid of the effect of both small and large eigenvalues of the coefficient matrix. The resulting methods are called projection methods...

متن کامل

A Comparison of Two-Level Preconditioners Based on Multigrid and Deflation

It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coefficient matrices are symmetric and positive definite. A two-level PCG method combines a traditional (one-level) preconditioner, such as incomplete Cholesky, with a projection-type preconditioner to get rid of the effec...

متن کامل

DELFT UNIVERSITY OF TECHNOLOGY REPORT 08-05 Theoretical Comparison of Two-Level Preconditioners based on Multigrid and Deflation

It is well-known that two-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coefficient matrices are symmetric and positive definite (SPD). A two-level PCG method combines traditional and projectiontype preconditioners to get rid of the effect of both small and large eigenvalues of the coefficient matrix. In the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scientific Computing

سال: 2009

ISSN: 0885-7474,1573-7691

DOI: 10.1007/s10915-009-9272-6